Throughput analysis of Non-Renegable Selective Acknowledgments (NR-SACKs) for SCTP

نویسندگان

  • Ertugrul Yilmaz
  • Nasif Ekiz
  • Preethi Natarajan
  • Paul D. Amer
  • Jonathan T. Leighton
  • Fred Baker
  • Randall R. Stewart
چکیده

Preliminary work introduced Non-Renegable Selective Acknowledgments (NR-SACKs) and showed they (i) better utilize a data sender’s memory in both SCTP and CMT, and (ii) improve throughput in CMT. In this paper, we provide the latest specification of NR-SACKs, and extend the investigation of throughput improvements that NR-SACKs can provide. Using ns-2 simulation, for various loss conditions and bandwidth-delay combinations, we show that the throughput observed with NR-SACKs is at least equal and sometimes better than the throughput observed with SACKs. We introduce ‘‘region of gain” which defines for a given bandwidth, delay, and send buffer size combination, what range of loss rates results in significant throughput improvement when NR-SACKs are used instead of SACKs. In both SCTP and CMT, NRSACKs provide greater throughput improvement as the send buffer size decreases, and as end-to-end delay decreases. Provided that the bandwidth-delay product (BDP) P send buffer size, additional bandwidth does not increase NR-SACKs’ throughput improvements for either SCTP or CMT. For BDPs < send buffer size, the throughput improvement decreases as the BDP decreases. 2010 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance analysis and improvement of PR-SCTP for small messages

PR-SCTP, a partially reliable extension of SCTP, provides a flexible QoS tradeoff between timeliness and reliability for application traffic. However, the performance of PR-SCTP can be affected by certain traffic characteristics and network scenarios. We previously proposed an NR-SACK based optimization for PR-SCTP. In this work we extensively evaluate and analyze the performance of PR-SCTP wit...

متن کامل

Adaptive End - to - End Mobility Scheme for Seamless Horizontal and Vertical Handoffs

Mobility management constitutes one of the most significant task to be investigated for Next Generation Mobile Networks (4G). Motivated by connectivity facilities and flow control offered at the transport layer, a number of Stream Control Transmission Protocols (SCTPs) based mobility schemes have been proposed to handle this important issue. However, these proposals are hindered by drawbacks su...

متن کامل

Improving End-to-End Throughput of Mobile IP using SCTP

Mobile IP is the IETF-proposed standard to offer seamless mobile computing. A new transport layer protocol, called Stream Control Transmission Protocol (SCTP), has recently been accepted by IETF as a proposed standard to address a number of TCP limitations. Most of the previous research on end-to-end throughput over Mobile IP has been carried out on TCP-Reno. Both TCP and SCTP can use Selective...

متن کامل

Performance analysis of TCP and SCTP over Satellite Networks due to Effect of Congestion Control

Stream Control Transmission Protocol (SCTP) is a new transport layer protocol which can be deployed in the Internet along with TCP. In this paper, we investigate the performance issues that arise when SCTP and TCP are used in the same satellite network. We evaluate performance through measurement of throughput, and also fairness of use of networks resources by the two protocols. We observed tha...

متن کامل

On SCTP multi-homing performance

The Stream Control Transmission Protocol (SCTP) is a general purpose transport protocol featuring multi-homing support, message oriented and more flexible data delivery mechanisms than TCP, and an increased protection against well-known attacks. Originally developed for the transport of Signaling System No. 7 messages, e.g. MTP level 3 user primitives, over IP networks, SCTP has evolved to a ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2010